A Unified Framework for Equivalence Verification of Datapath Oriented Applications

نویسندگان

  • Bijan Alizadeh
  • Masahiro Fujita
چکیده

In this paper, we introduce a unified framework based on a canonical decision diagram called Horner Expansion Diagram (HED) [1] for the purpose of equivalence checking of datapath oriented hardware designs in various design stages from an algorithmic description to a gate-level implementation. The HED is not only able to represent and manipulate algorithmic specifications in terms of polynomial expressions with modulo equivalence but also express bit level adder (BLA) description of the gate-level implementation. Our HED can support modular arithmetic operations over integer rings of the form Z2. The proposed techniques have successfully been applied to the equivalence checking problem of industrial benchmarks. The experimental results on different applications have shown significant advantages over existing bit-level and also word-level equivalence checking techniques.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Verification of arithmetic datapath designs using word-level approach - A case study

The paper describes an efficient method to prove equivalence between two integer arithmetic datapath designs specified at the register transfer level. The method is illustrated with an industrial ALU design. As reported in literature, solving it using a commercial equivalence checking tool required casesplitting, which limits its applicability to larger designs. We show how such a task can be s...

متن کامل

Automated Formal Equivalence Verification of Pipelined Nested Loops in Datapath Designs

The ever-growing complexity of digital systems has made designers move toward using Electronic System Level (ESL) design methodology at a higher abstraction level. The designs at ESL are then automatically synthesized to Register Transfer Level (RTL) by means of High Level or behavioral Synthesis (HLS) tools. Due to possibility of buggy synthesis, especially when the target design must be manip...

متن کامل

Arithmetic Transforms for Verifying Compositions of Sequential Datapaths

In this paper, we address the issue of obtaining compact canonical representations of datapath circuits with sequential elements, for the purpose of equivalence checking. First, we demonstrate the mechanisms for efficient compositional construction of Arithmetic Transform (AT), which is the underlying function representation, used in modern word-level decision diagrams. Second, we introduce a w...

متن کامل

Level Oriented Formal Model for Asynchronous Circuit Verification and its Efficient Analysis Method

Using a level-oriented model for verification of asynchronous circuits helps users to easily construct formal models with high readability or to naturally model datapath circuits. On the other hand, in order to use such a model on large circuits, techniques to avoid the state explosion problem must be developed. This paper first introduces a level-oriented formal model based on time Petri nets,...

متن کامل

Automatic Pipeline Synthesis and Formal Verification from Transactional Datapath Specifications

............................................................................................................................ iii Acknowledgements ..............................................................................................................i List of Tables......................................................................................................................vi List...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEICE Transactions

دوره 92-D  شماره 

صفحات  -

تاریخ انتشار 2009